package com.cheung.leetcode.dp;

import org.junit.jupiter.api.Test;

/**
 * @BelongsProject : java-leetcode
 * @BelongsPackage : com.cheung.leetcode.dp
 * @Author :  cheungming
 * @CreateTime : 2024-06-17 09:19:43
 * @Description : 打家劫舍
 * @Version : 1.0
 */
public class Code198Test {
    public int rob(int[] nums) {
        if (nums.length == 0) {
            return 0;
        }
        if (nums.length == 1) {
            return nums[0];
        }
        // dp[i] = max(dp[i-2]+nums[i], dp[i-1])
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);
        for (int i = 2; i < nums.length; i++) {
            dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1]);
        }
        return dp[nums.length - 1];
    }

    @Test
    public void test1() {
        assert rob(new int[]{1, 2, 3, 1}) == 4;
    }

    @Test
    public void test2() {
        assert rob(new int[]{2, 7, 9, 3, 1}) == 12;
    }

    @Test
    public void test3() {
        assert rob(new int[]{1}) == 1;
    }

    @Test
    public void test4() {
        assert rob(new int[]{}) == 0;
    }
}
